Minimum Distance Index for BSS, Generalization, Interpretation and Asymptotics
نویسندگان
چکیده
منابع مشابه
Asymptotics for a generalization of Hermite polynomials
We consider a generalization of the classical Hermite polynomials by the addition of terms involving derivatives in the inner product. This type of generalization has been studied in the literature from the point of view of the algebraic properties. Thus, our aim is to study the asymptotics of this sequence of nonstandard orthogonal polynomials. In fact, we obtain Mehler–Heine type formulas for...
متن کاملLocal Asymptotics and the Minimum Description Length
Common approximations for the minimum description length (MDL) criterion imply that the cost of adding a parameter to a model fit to n observations is about (1/2) log n bits. While effective for parameters which are large on a standardized scale, this approximation overstates the parameter cost near zero. A uniform approximation and local asymptotic argument show that the addition of a small pa...
متن کاملInterpretation and Generalization of Score Matching
Score matching is a recently developed parameter learning method that is particularly effective to complicated high dimensional density models with intractable partition functions. In this paper, we study two issues that have not been completely resolved for score matching. First, we provide a formal link between maximum likelihood and score matching. Our analysis shows that score matching find...
متن کاملAnalogical Generalization and Retrieval for Denominal Verb Interpretation
The creativity of natural language poses a significant theoretical problem. One example of this is denominal verbs (those derived from nouns) such as spoon in “She spooned me some sugar”. Traditional generative approaches typically posit a unique entry in the lexicon for this usage, though this approach has difficulty scaling. Construction Grammar has evolved as a competing theory which instead...
متن کاملDegree distance index of the Mycielskian and its complement
In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Austrian Journal of Statistics
سال: 2020
ISSN: 1026-597X
DOI: 10.17713/ajs.v49i4.1130